Power-law relations in random networks with communities
نویسندگان
چکیده
منابع مشابه
Power-law relations in random networks with communities
Most random graph models are locally tree-like-do not contain short cycles-rendering them unfit for modeling networks with a community structure. We introduce the hierarchical configuration model (HCM), a generalization of the configuration model that includes community structures, while properties such as the size of the giant component, and the size of the giant percolating cluster under bond...
متن کاملfault location in power distribution networks using matching algorithm
چکیده رساله/پایان نامه : تاکنون روشهای متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روشها در شبکه توزیع به دلایلی همچون وجود انشعابهای متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تکفاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...
Power relations in cyber communities
Peoples’ need to socialise with others and greed for power can be best captured with Aristotle's famous description of human beings as “political animals”/”social animals”. It is interesting to watch how cyber communities, such as Web-based forums and mailing lists, manifest themselves through social interactions and shared values, membership and friendship, and commitments and loyalty. It is i...
متن کاملPower-law random walks.
In this paper, random walks with independent steps distributed according to a Q-power-law probability distribution function with Q=1/(1-q) are studied. In the case q>1, we show that (i) a stochastic representation of the location of the walk after n steps can be explicitly given (for both finite and infinite variance) and (ii) a clear connection with the superstatistics framework can be establi...
متن کاملRandom Walks with Lookahead on Power Law Random Graphs
We show that in power law random graphs, a.s., the expected rate at which a random walk with lookahead discovers the nodes of the graph is sublinear. Searching a graph by simulating a random walk is a natural way to abstract Web crawling [5]. Recently, the random walk simulation method has been also proposed to search P2P networks [11], [4], [10]. Therefore, it is important to characterize the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2016
ISSN: 2470-0045,2470-0053
DOI: 10.1103/physreve.94.012302